| |
| description |
In this paper, we present a Peer-to-Peer (P2P) spatial information
discovery system that enables spatial range queries over Distributed
Hash Tables (DHTs). Our system utilizes a less-distorting octahedral
map projection in contrast to the quadrilateral projections used by
majority of the previously proposed systems, to represent the
spatial information. We also introduce a Space-Filling Curve
(SFC)-based data placement strategy that reduces the probability of
data hot-spots in the network. Moreover, we show that our system
achieves scalable resolution of location-based range queries by
utilizing a tree-based query optimization algorithm. Compared to the
basic query resolution algorithm, the query optimization algorithm
reduces the average number of parallel messages used to resolve a
query, by a factor of 96%.
|
| publisher |
ACM
|
| type |
Text
|
| Article in Proceedings
|
| source |
In: (To appear) In Procs. of 4th International Conference on
COMmunication System softWAre and middlewaRE (COMSWARE'09),
Dublin, Ireland, June 2009. ACM., pp. 1-12
|
| contributor |
IPVS, Verteilte Systeme
|
| subject |
Network Architecture and Design (CR C.2.1)
|
| Information Search and Retrieval (CR H.3.3)
|